λ¬Έμ
[Programmers - μ€νμ±ν λ°©](https://programmers.co.kr/learn/courses/30/lessons/42888
π Logic
Map<String, String> user = new LinkedHashMap<>();
ArrayList<Pair> inOut = new ArrayList<>();
for (String rec : record) {
String[] info = rec.split(" ");
char word = rec.charAt(0);
if (word == 'E') {
user.put(info[1], info[2]);
inOut.add(new Pair(word, info[1]));
} else if (word == 'L') {
inOut.add(new Pair(word, info[1]));
} else {
user.put(info[1], info[2]);
}
}
Mapμλ μ μ μμ΄λ, λλ€μ μμ μ μ₯νλ€.ArrayList<Pair>μλ μ¬μ©μμ μ , ν΄μ₯ μ¬λΆμ ν΄λΉνλ μ μ μμ΄λλ₯Ό μ μ₯νλ€.- μ , ν΄μ₯μ΄ λͺ¨λ λλ ν, μμμ μ μ μμ΄λμ λ°λΌ λλ€μμ μΆλ ₯νλ€.
π CODE
μ½λ 보기/μ κΈ°π«
import java.util.*;
class Pair {
char command;
String name;
public Pair(char command, String name) {
this.command = command;
this.name = name;
}
}
class Solution {
static String in = "λμ΄ λ€μ΄μμ΅λλ€.";
static String out = "λμ΄ λκ°μ΅λλ€.";
public String[] solution(String[] record) {
// userλ μ μ μμ΄λμ ν΄λΉνλ λλ€μμ μ μ₯
// inOutμ μ¬μ©μμ μ
μ₯, ν΄μ₯ μ¬λΆμ ν΄λΉνλ μ μ μμ΄λλ₯Ό μ μ₯
Map<String, String> user = new LinkedHashMap<>();
ArrayList<Pair> inOut = new ArrayList<>();
for (String rec : record) {
String[] info = rec.split(" ");
char word = rec.charAt(0);
if (word == 'E') {
user.put(info[1], info[2]);
inOut.add(new Pair(word, info[1]));
} else if (word == 'L') {
inOut.add(new Pair(word, info[1]));
} else {
user.put(info[1], info[2]);
}
}
String[] answer = new String[inOut.size()];
int idx = 0;
for (Pair p : inOut) {
StringBuilder sb = new StringBuilder(user.get(p.name));
sb.append(p.command == 'E' ? in : out);
answer[idx] = sb.toString();
idx++;
}
return answer;
}
}
βοΈ Review
- μ¬μ΄ λ¬Έμ μλ€!